116 research outputs found
Mixed integer predictive control and shortest path reformulation
Mixed integer predictive control deals with optimizing integer and real
control variables over a receding horizon. The mixed integer nature of controls
might be a cause of intractability for instances of larger dimensions. To
tackle this little issue, we propose a decomposition method which turns the
original -dimensional problem into indipendent scalar problems of lot
sizing form. Each scalar problem is then reformulated as a shortest path one
and solved through linear programming over a receding horizon. This last
reformulation step mirrors a standard procedure in mixed integer programming.
The approximation introduced by the decomposition can be lowered if we operate
in accordance with the predictive control technique: i) optimize controls over
the horizon ii) apply the first control iii) provide measurement updates of
other states and repeat the procedure
Finite Alphabet Control of Logistic Networks with Discrete Uncertainty
We consider logistic networks in which the control and disturbance inputs
take values in finite sets. We derive a necessary and sufficient condition for
the existence of robustly control invariant (hyperbox) sets. We show that a
stronger version of this condition is sufficient to guarantee robust global
attractivity, and we construct a counterexample demonstrating that it is not
necessary. Being constructive, our proofs of sufficiency allow us to extract
the corresponding robust control laws and to establish the invariance of
certain sets. Finally, we highlight parallels between our results and existing
results in the literature, and we conclude our study with two simple
illustrative examples
Consensus for switched networks with unknown but bounded disturbances
We consider stationary consensus protocols for networks of dynamic agents
with switching topologies. The measure of the neighbors' state is affected by
Unknown But Bounded disturbances. Here the main contribution is the formulation
and solution of what we call the -consensus problem, where the states
are required to converge in a tube of ray asymptotically or in
finite time.Comment: 18 pages, 3 figures. The manuscript has been submitted for the
Special issue on Control and optimization in Cooperative Networks. Submitted
to SIAM SICO
Aggregate Energy Production in Wind Farms via Dynamic Robust Coalitional Games
This paper investigates the benefits of aggregating independent wind power producers. First, we quantify the expected joint profit in the case where such producers act as a single entity in a one-stage contract interval, and in a multi-stage contract interval with recourse. Second, we provide a constructive method to design stable allocation mechanisms in the case where the expected profit is changing with time. Third, we prove that the allocation policy stabilizes the coalition by correcting allocations in real-time in the case where the realized power output deviates from the contract size of the ahead market
- …